On Heuristic Time Hierarchies Preliminary Version
نویسنده
چکیده
We study the existence of time hierarchies for heuristic algorithms. We prove that a time hierarchy exists for heuristics algorithms in such syntactic classes as NP and coNP, and also in semantic classes AM and MA. Earlier, Fortnow and Santhanam (FOCS’04) proved the existence of a time hierarchy for heuristics algorithms in BPP. We present an alternative approach and give a simpler proof.
منابع مشابه
Fast BVH Construction on GPUs
We present two novel parallel algorithms for rapidly constructing bounding volume hierarchies on manycore GPUs. The first uses a linear ordering derived from spatial Morton codes to build hierarchies extremely quickly and with high parallel scalability. The second is a top-down approach that uses the surface area heuristic (SAH) to build hierarchies optimized for fast ray tracing. Both algorith...
متن کاملHeuristic Time Hierarchies via Hierarchies for Sampling Distributions
We give a new simple proof of the time hierarchy theorem for heuristic BPP originally proved by Fortnow and Santhanam [FS04] and then simplified and improved by Pervyshev [Per07]. In the proof we use a hierarchy theorem for sampling distributions recently proved by Watson [Wat13]. As a byproduct we get that P 6⊆ BPTime[nk] if one way functions exist. As far as we know this statement was not kno...
متن کاملA Comparison of Action-Based Hierarchies and Decision Trees for Real-Time Performance
Decision trees have provided a classical mechanism for progressively narrowing down a search from a large group of possibilities to a single alternative. The structuring of a decision tree is based on a heuristic that maximizes the value of the information gained at each level in the hierarchy. Decision trees are effective when an agent needs to reach the goal of complete diagnosis as quickly a...
متن کاملHeuristic Contraction Hierarchies with Approximation Guarantee
We present a new heuristic point-to-point routing algorithm based on contraction hierarchies (CH). Given an ε ≥ 0, we can prove that the length of the path computed by our algorithm is at most (1 + ε) times the length of the optimal (shortest) path. CH is based on node contraction: removing nodes from a network and adding shortcut edges to preserve shortest path distances. Our algorithm tries t...
متن کاملDetection of Design Patterns Using Design Pattern Nearness Marking (dpnm) Algorithm
Detection of design pattern methodology is based on match gain between graph vertices. This approach has the combined action power of detection normal, changed version patterns and nearness marking. This approach make use of the fact that patterns reside in one or additional inheritance hierarchies, reducing the dimensions of the graphs to that the algorithm is applied. Finally, the algorithm d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006